Refinements of the Half-Bit and Factor-of-Two Bounds for Capacity in Gaussian Channel with Feedback

نویسندگان

  • Han Wu Chen
  • Kenjiro Yanagi
چکیده

We consider the upper bounds of the finite block length capacity Cn,FB(P ) of the discrete time Gaussian channel with feedback. We also let Cn(p) the nonfeedback capacity. We prove the relations Cn(P ) ≤ Cn,FB(P ) ≤ Cn(αP ) + 1 2 ln(1 + 1 α ) and Cn(P ) ≤ Cn,FB(P ) ≤ (1 + 1 α )Cn(αP ) for any P > 0 and any α > 0, which induce the half-bit and factor-of two bounds given by Cover and Pombra in the special case of α = 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel

In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...

متن کامل

Capacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference

Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios‎. First, it is shown that the additive Gaussian ch...

متن کامل

Gaussian Z Channel with Intersymbol Interference

In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...

متن کامل

Factor-of-two Bound for Capacity in Gaussian Channel with Feedback and Cover’s Conjecture

We consider the upper bounds of the finite block length capacity Cn,FB(P ) of the discrete time Gaussian channel with feedback. We prove the refinements of relations Cn(P ) ≤ Cn,FB(P ) ≤ Cn(P ) + 1 2 and Cn(P ) ≤ Cn,FB(P ) ≤ 2Cn(P ), which are given by Cover and Pombra. And we prove the relation C2(P ) ≤ C2,FB(P ) < C2(2P ), which is a partial solution of the conjecture given by Cover.

متن کامل

On the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels

In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 45  شماره 

صفحات  -

تاریخ انتشار 1999